Random Multi-Hopper Model. Super-Fast Random Walks on Graphs
نویسندگان
چکیده
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the parameters of these transforms approach zero asymptotically, the multi-hopper's hitting times between any two nodes in the graph converge to their minimum possible value, given by the hitting times of a normal random walker on a complete graph. Stated differently, for small parameter values the multi-hopper explores a general graph as fast as possible when compared to a random walker on a full graph. Using computational experiments we show that compared to the normal random walker, the multi-hopper indeed explores graphs with clusters or skewed degree distributions more efficiently for a large parameter range. We provide further computational evidence of the speed-up attained by the random multi-hopper model with respect to the normal random walker by studying deterministic, random and real-world networks. 1. Introduction. Few mathematical models have found so many applications in the physical, chemical, biological, social and economical sciences as the random walk model [20, 27]. The term " random walk " was first proposed by K. Pearson [38] in an informal question posted in Nature in 1905. Pearsons description reads as " A man starts from a point O and walks l yards in a straight line; he then turns through any angle whatever and walks another l yards in a second straight line. He repeats this process n times. " Among the first respondents to Pearson, Lord Rayleigh [40] already pointed out a connection existing between random walks and other physical processes, namely that a random walk " is the same as that of the composition of n iso-periodic vibrations of unit amplitude and of phases distributed at random ". Connections like these between random walks and many physico-chemical, biological and socioeconomic processes are what guarantees the great vitality of this research topic. This includes relations between random walks, Brownian motion and diffusive processes in general [9], the connection between random walks and the classical theory of electricity [10, 34], and the formulation of the efficient market hypothesis [26], among others. In order to distinguish the originally-proposed random walk model …
منابع مشابه
Coalescent Random Walks on Graphs
Inspired by coalescent theory in biology, we introduce a stochastic model called ”multi-person simple random walks” or “coalescent random walks” on a graph G. There are any finite number of persons distributed randomly at the vertices of G. In each step of this discrete time Markov chain, we randomly pick up a person and move it to a random adjacent vertex. To study this model, we introduce the...
متن کاملOn coalescence time in graphs-When is coalescing as fast as meeting?
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a single random walk. The coalescence time is defined as the expected time until only one particle remains, starting from one particle at every node. Despite re...
متن کاملCommunity Detection Using Slow Mixing Markov Models
The task of community detection in a graph formalizes the intuitive task of grouping together subsets of vertices such that vertices within clusters are connected tighter than those in disparate clusters. This paper approaches community detection in graphs by constructing Markov random walks on the graphs. The mixing properties of the random walk are then used to identify communities. We use co...
متن کاملSimple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead hyper-graphs better capture the communication over a wireless...
متن کاملHow to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
Motivated by real world networks and use of algorithms based on random walks on these networks we study the simple random walks on dynamic undirected graphs with fixed underlying vertex set, i.e., graphs which are modified by inserting or deleting edges at every step of the walk. We are interested in the expected time needed to visit all the vertices of such a dynamic graph, the cover time, und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.08631 شماره
صفحات -
تاریخ انتشار 2016